Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
نویسندگان
چکیده
منابع مشابه
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy
Lower bounds on circuit size were previously established for functions in Σp2, ZPP , Σ exp 2 , ZPEXP NP and MAexp. We investigate the general question: Given a time bound f(n). What is the best circuit size lower bound that can be shown for the classes MA-TIME[f ], ZP-TIME[f ], . . . using the techniques currently known? For the classes MAexp, ZPEXP NP and Σ exp 2 , the answer we get is “halfex...
متن کاملThe Polynomial - Exponential Equation
We solve the equation of the title for q = 3 and, partially, for q = 2. These are the only prime values of q for which there exist integer solutions. Our arguments are based upon off-diagonal Padé approximation to the binomial function.
متن کاملDouble-Exponential LR Circuit
S imple LR and RC circuits are familiar to generations of physics students as examples of single-exponential growth and decay in the relevant voltages, currents, and charges. An element of novelty can be introduced by connecting two (instead of one) LR coils in parallel with a battery. The resulting circuit can still be treated using little more than the basic tools (Kirchhoff ’s rules plus a t...
متن کاملPolynomial versus exponential growth in repetition-free binary words
It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line between polynomial and exponential growth is 73 . More precisely, there are only polynomially many binary words of length n that avoid 7 3 -powers, but there are exponentially many binary words of length n that avo...
متن کاملSparse Polynomial Exponential Sums
(1.2) f(x) = a1x k1 + · · ·+ arx with 0 < k1 < k2 < · · · < kr. We assume always that the content of f , (a1, a2, . . . , ar), is relatively prime to the modulus q. Let d = d(f) = kr denote the degree of f and for any prime p let dp(f) denote the degree of f read modulo p. A fundamental problem is to determine whether there exists an absolute constant C such that for an arbitrary positive integ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1999
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v6i46.20116